Representing quasi-orders by embeddability ordering of families of topological spaces
نویسندگان
چکیده
منابع مشابه
Representing Quasi-orders by Embeddability Ordering of Families of Topological Spaces
An elementary argument constructs, for each cardinal α, a topological space whose subspaces, ordered by homeomorphic embeddability, can model every partial order on α-many points. We show how to modify this procedure to deal also with quasi-orders (where the antisymmetry condition may fail), obtaining an initial estimate of the cardinality of the space then required.
متن کاملWell-quasi-ordering graphs by the topological minor relation
Robertson and Seymour proved that graphs are well-quasi-ordered by the minor relation and the weak immersion relation in the prominent Graph Minors series. That is, given infinitely many graphs, one graph contains another as a minor (or a weak immersion, respectively). However, the topological minor relation does not well-quasi-order graphs. For every positive integer i, let Gi be the graph obt...
متن کاملsome properties of fuzzy hilbert spaces and norm of operators
in this thesis, at first we investigate the bounded inverse theorem on fuzzy normed linear spaces and study the set of all compact operators on these spaces. then we introduce the notions of fuzzy boundedness and investigate a new norm operators and the relationship between continuity and boundedness. and, we show that the space of all fuzzy bounded operators is complete. finally, we define...
15 صفحه اولRepresenting embeddability as set inclusion
A few steps are made towards representation theory of embeddability among uncountable graphs. A monotone class of graphs is defined by forbidding countable subgraphs, related to the graphs end-structure. Using a combinatorial theorem of Shelah it is proved: The complexity of the class in every regular uncountable A > Mi is at least A+ + sup{/x : jx+ < A} For all regular uncountable A > Mi there...
متن کاملThe topological ordering of covering nodes
The topological ordering algorithm sorts nodes of a directed graph such that the order of the tail of each arc is lower than the order of its head. In this paper, we introduce the notion of covering between nodes of a directed graph. Then, we apply the topological orderingalgorithm on graphs containing the covering nodes. We show that there exists a cut set withforward arcs in these...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1999
ISSN: 0002-9939,1088-6826
DOI: 10.1090/s0002-9939-99-04848-0